Semi-empirical likelihood ratio confidence intervals for the difference of two sample means

We all know that we can use the likelihood ratio statistic to test hypotheses and construct confidence intervals in full parametric models. Recently, Owen (1988,Biometrika,75, 237–249; 1990,Ann. Statist.,18, 90–120) has introduced the empirical likelihood method in nonparametric models. In this paper, we combine these two likelihoods together and use the likelihood ratio to construct confidence intervals in a semiparametric problem, in which one model is parametric, and the other is nonparametric. A version of Wilks's theorem is developed.     

On computational proofs of the existence of solutions to nonlinear parabolic problems

This paper is an extension of the preceding study (Nakao, this journal, 1991) in which we described a numerical verification method of the solution for one-space dimensional parabolic problems, to the several-space dimensional case. Here, numerical verification means the automatic proof of the existence of solutions to the problems by some numerical techniques on a computer. We reformulate the verification condition for nonlinear parabolic initial boundary value problems using the fixed-point problem of a compact operator on certain function spaces. As in the preceding study based upon a simple C⁰ finite-element approximation and its constructive a priori error estimates, a numerical verification procedure is presented with some numerical examples.     

On splittable colorings of graphs and hypergraphs

The notion of a split coloring of a complete graph was introduced by Erd?s and Gyárfás [ 7 ] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an adversary. We show that the techniques used and bounds obtained on the extremal (r,m)‐split coloring problem of [ 7 ] are closer in nature to the Turán theory of graphs rather than Ramsey theory. We extend the notion of these colorings to hypergraphs and provide bounds and some exact results. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 226–237, 2002     

ON THE EXISTENCE OF ZERO POINTS OF A CONTINUOUS FUNCTION

IPreliminarlesTheee。etOOk totot比OO。stsllCCdCSdO‘lOll‘。山OOqll时1OO/(。)＝。,SS山 SFSSdPoint Theorems[‘’,”],Degree Theory【9,15]．In general these are used when f aPPlies a set ora space on itself．Cm眈inn眈ion Methods can be used to test the existence ofa solution whenf pplies a set or a sp。e on it咖‘－’,”－“l,or aPPlies a set or sP。m another sP。,s。M see here．wrthermore,contlnuulon methods pve us the exlstence ofcurves wb讪 can beused to CalCttlue the Sdutionsl6…     

二阶非线性奇异边值问题的正解

本文运用不动点定理建立了奇性与一阶导数有关的二阶非线性奇异边值问题的正解存在性．其中非线性项ｆ（ｔ，ｕ，ｚ）在：（ｉ）ｚ＝０但不在ｕ＝０；（ｉｉ）ｚ＝０且ｕ＝０处具有奇性．     

On the Dynamics of the Classical Transverse Field Ising Chain

We investigate stationary and travelling wave solutions of a special lattice differential equation in one space dimension. Depending on a parameter λ, results are given on the existence, shape and stability for these kind of solutions. The analysis of travelling wave solutions leads us to a functional differential equation with both forward and backward shifts. The existence of solutions of this equation will be proved by use of the implicit function theorem. In particular, we consider kink solutions and periodic solutions.     

字定理在Heegaard分解方面的一个应用

The word theorem states that x can be denoted as a rotation inserting word of A if x is in the normal closure of A in F(X). As an application of the theorem, in this note a condition that guarantees reducing the genus of Heegaard splitting of 3-manifolds is given. This leads Poincare conjecture to a new formulation.     

金融资产收益分布的混合高斯分析

本文研究了金融资产收益的混合高斯分布模型 ,给出了混合高斯分布的 Kolmogorov-Smirnov检验的方法 ,分析了金融资产收益的非高斯性及市场价格运动的有效性 .此外 ,用成分数目 K*、拟合误差 DK*n和主成分系数 p*k 描述金融资产收益的性质 ,对外汇银行同业拆借市场和中国股票市场实证分析     

Eberlein mulian定理在局部凸空间中的推广

设（Ｅ，Ｔ）是一个分离的局部凸空间．本文主要结果是：（１）如果（Ｅ，Ｔ）是次可分的，那么ＡＥ是相对弱紧集Ａ是相对弱可数紧集Ａ是相对弱序列紧集．（２）如果（Ｅ，Ｔ）是强次可分且（Ｅ，β（Ｅ，Ｅ））是桶型空间，那么ＡＥ是相对弱紧集Ａ是相对弱可数紧集Ａ是相对弱序列紧集．     

Principe de densité pour les groupes rèuctifs

The main goal of this Letter is to give a new proof of a result conjectured by D. De George and N. Wallach and proved by P. Deborne and to extend it to the S-arithmetic setting. The proof is based on a density principle.